Continuous functions minimization by dynamic random search technique
نویسندگان
چکیده
منابع مشابه
MINIMIZATION BY RANDOM SEARCH TECHNIQUES*t
Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive...
متن کاملNONLINEAR FRAME ANALYSIS BY MINIMIZATION TECHNIQUE
By minimizing the total potential energy function and deploying the virtual work principle, a higher-order stiffness matrix is achieved. This new tangent stiffness matrix is used to solve the frame with geometric nonlinear behavior. Since authors’ formulation takes into account the higher-order terms of the strain vector, the convergence speed of the solution process will increase. In fac...
متن کاملProgressive Global Random Search of Continuous Functions I
A sequential random search method for the global minimization of a continuous function is proposed. The algorithm gradually concentrates the random search effort on areas neighboring the global minima. A modification is included for the case that the function cannot be exactly evaluated. The global convergence and the asymptotical optimality of the sequential sampling procedure are proved for b...
متن کاملRandom Continuous Functions
We investigate notions of randomness in the space C(2N) of continuous functions on 2N. A probability measure is given and a version of the Martin-Löf Test for randomness is defined. Random ∆2 continuous functions exist, but no computable function can be random and no random function can map a computable real to a computable real. The image of a random continuous function is always a perfect set...
متن کاملRandom Gradient-Free Minimization of Convex Functions
In this paper, we prove the complexity bounds for methods of Convex Optimization based only on computation of the function value. The search directions of our schemes are normally distributed random Gaussian vectors. It appears that such methods usually need at most n times more iterations than the standard gradient methods, where n is the dimension of the space of variables. This conclusion is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematical Modelling
سال: 2007
ISSN: 0307-904X
DOI: 10.1016/j.apm.2006.08.015